Neutrosophic Relational Database Decomposition
نویسندگان
چکیده
منابع مشابه
Neutrosophic Relational Database Decomposition
In this paper we present a method of decomposing a neutrosophic database relation with Neutrosophic attributes into basic relational form. Our objective is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or vague relation can only handle incomplete information. Authors are taking the Neutrosophic Relational database [8], [2] to show how imprecise data can ...
متن کاملNeutrosophic Relational Data Model
In this paper, we present a generalization of the relational data model based on interval neutrosophic set [1]. Our data model is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or intuitionistic fuzzy relation can only handle incomplete information. Associated with each relation are two membership functions one is called truth-membership function T which ...
متن کاملSyntactic Modular Decomposition of Large Ontologies with Relational Database
Support for modularity allows complex ontologies to be separated into smaller pieces (modules) that are easier to maintain and compute. Instead of considering the entire complex ontology, users may bene t more by starting from a problem-speci c set of concepts (signature of problem) from the ontology and exploring its surrounding logical modules. Additionally, an ontology modularization mechani...
متن کاملNeutrosophic Logic Based Inconsistent Relational Database for Normalizing Data and Accurate Decision
In this paper the author propose a new method of search called Neutrosophic search to find the most suitable match for the predicates to answer any imprecise query made by the database users. Neutrosophic search is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or vague relation can only handle incomplete information. Neutrosophic logic is an extension of...
متن کاملRelational Decomposition
We introduce relational decomposition, a technique for formally reducing termination-insensitive relational program logics to unary logics, that is program logics for one-execution properties. Generalizing the approach of selfcomposition, we develop a notion of interpolants that decompose along the phrase structure, and relate these interpolants to unary and relational predicate transformers. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2011
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2011.020822